Snail Choke

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Understanding CHOKe

A recently proposed active queue management, CHOKe, is stateless, simple to implement, yet surprisingly effective in protecting TCP from UDP flows. As UDP rate increases, even though the number of UDP packets in the queue rises, its bandwidth share eventually drops to zero, in stark contrast to the behavior of a regular FIFO buffer. We derive a detailed model of CHOKe that accurately predicts t...

متن کامل

P-CHOKe: A Piggybacking-CHOKe AQM Congestion Control Method

Abstract— The Active Queue Management (AQM) is a technique that consists of ECN (Explicit Congestion notifications) in internet routers. Congestion is an important issue which researcher focuses on in the TCP network environment. AQM is a router – based mechanism for early detection of congestion inside the network. This paper provides an analysis of congestion metric with flow information in q...

متن کامل

Do Professionals Choke Under Pressure?

Do Professionals Choke Under Pressure? High rewards or the threat of severe punishment do not only provide incentives to exert high levels of effort but also create pressure. Such pressure can cause paradoxical performance effects, namely performance decrements despite strong incentives and high motivation. By analyzing the performance of professional football players on a well-defined task, na...

متن کامل

Generalizing the CHOKe flow protection

This paper proposes a simple and stateless active queue management (AQM) scheme, called geometric CHOKe (gCHOKe), to protect responsive flows from unresponsive ones. gCHOKe has its root on and is a generalization of the original CHOKe. It provides an additional power of protection, achieved by introducing an extra flow matching trial following each successful flow comparison of packets. The max...

متن کامل

Beyond CHOKe: Stateless Fair Queueing

Making drop decisions to enforce the max-min fair resource allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index l (MLC(l)). We show analytically, using a Markov chain model, that for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Clinical Research in Radiology

سال: 2019

ISSN: 2639-913X

DOI: 10.33309/2639-913x.020101